#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <unordered_map>
// 最长公共子序列：https://leetcode.cn/problems/longest-common-subsequence/description/
using namespace std;
class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        int m=text1.size();
        int n=text2.size();
        text1=' '+text1;
        text2=' '+text2;
        vector<vector<int>> dp(m+1,vector<int>(n+1));
        for(int i=1;i<=m;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(text1[i]==text2[j])
                    dp[i][j]=1+dp[i-1][j-1];
                else
                    dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
            }
        }
        return dp[m][n];
    }
};